An Approach to Knowledge Base Completion by a Committee-Based Knowledge Graph Embedding
نویسندگان
چکیده
منابع مشابه
Probabilistic Belief Embedding for Knowledge Base Completion
This paper contributes a novel embedding model which measures the probability of each candidate belief 〈h, r, t,m〉 in a large-scale knowledge repository via simultaneously learning distributed representations for entities (h and t), relations (r), and even the words in relation mentions (m). It facilitates knowledge completion by means of simple vector operations to discover new beliefs. Given ...
متن کاملProjE: Embedding Projection for Knowledge Graph Completion
With the large volume of new information created every day, determining the validity of information in a knowledge graph and filling in its missing parts are crucial tasks for many researchers and practitioners. To address this challenge, a number of knowledge graph completion methods have been developed using low-dimensional graph embeddings. Although researchers continue to improve these mode...
متن کاملRecurrent Neural Network Embedding for Knowledge-base Completion
Knowledge can often be represented using entities connected by relations. For example, the fact that tennis ball is round can be represented as “TennisBall HasShape Round”, where a “TennisBall” is one entity, “HasShape” is a relation and “Round” is another entity. A knowledge base is a way to store such structured information, a knowledge base stores triples of the “an entity-relation-an entity...
متن کاملCompositional Learning of Relation Paths Embedding for Knowledge Base Completion
Nowadays, large-scale knowledge bases containing billions of facts have reached impressive sizes; however, they are still far from completion. In addition, most existing methods only consider the direct links between entities, ignoring the vital impact about the semantic of relation paths. In this paper, we study the problem of how to better embed entities and relations into different low dimen...
متن کاملCommonsense Knowledge Base Completion
We enrich a curated resource of commonsense knowledge by formulating the problem as one of knowledge base completion (KBC). Most work in KBC focuses on knowledge bases like Freebase that relate entities drawn from a fixed set. However, the tuples in ConceptNet (Speer and Havasi, 2012) define relations between an unbounded set of phrases. We develop neural network models for scoring tuples on ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10082651